The Κ-antichain Property for (κ, 1)-simplified Morasses

نویسنده

  • CHARLES MORGAN
چکیده

We discuss Shelah, Väänänen and Veli£kovi¢'s recently introduced κ-antichain property for (κ, 1)-simpli ed morasses. We give a streamlined characterization of the property, and show how the property can be destroyed by forcing and hence that it is consistent that no (ω, 1)-simpli ed morasses have the property. We brie y touch on the combination of the antichain property with complete amalgamation systems.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Morasses and Finite Support Iterations

We introduce a method of constructing a forcing along a simplified (κ, 1)-morass such that the forcing satisfies the κ-chain condition. Alternatively, this may be seen as a method to thin out a larger forcing to get a chain condition. As an application, we construct a ccc forcing that adds an ω2-Suslin tree. Related methods are Shelah’s historic forcing and Todorcevic’s ρ-functions.

متن کامل

2 5 A ug 2 00 6 An Expansion of a Poset Hierarchy

This article extends a paper of Abraham and Bonnet which generalised the famous Hausdorff characterisation of the class of scattered linear orders. Abraham and Bonnet gave a poset hierarchy that characterised the class of scattered posets which do not have infinite antichains (abbreviated FAC for finite antichain condition). An antichain here is taken in the sense of incomparability. We define ...

متن کامل

Forcings constructed along morasses

In a previous paper [11], we introduced a way of constructing a forcing along a simplified (κ, 1)-morass such that the forcing satisfies a chain condition. The basic idea is to generalize iterated forcing with finite support as introduced by Solovay and Tennenbaum, which works with continuous, commutative systems of complete embeddings. However, instead of considering a linear system of embeddi...

متن کامل

Subtle and Ineffable Tree Properties

Now it is obvious from the usual definitions that an inaccessible κ is subtle iff every κ-tree T satisfies STP(T ), for which we shall just write κ-STP, iff the complete binary tree 2<κ satisfies STP(2<κ), and similarly for ineffability (and one can take this as a definition if unfamiliar with the concepts). By [Mit73] one can collapse a weakly compact (a Mahlo) cardinal onto ω2 such that in th...

متن کامل

A scattering of orders

A linear ordering is scattered if it does not contain a copy of the rationals. Hausdorff characterised the class of scattered linear orderings as the least family of linear orderings that includes the class B of well-orderings and reversed well-orderings, and is closed under lexicographic sums with index set in B. More generally, say that a partial ordering is κ-scattered if it does not contain...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2015